An approximation algorithm for the Euclidean incremental median problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
Given two sets of points in the plane, P of n terminals and S of m Steiner points, a Steiner tree of P is a tree spanning all points of P and some (or none or all) points of S. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, P and S, and a positive integer k ≤ m, find...
متن کاملAn Approximation Algorithm for the Euclidean Bottleneck Steiner Tree Problem
Given two sets of points in the plane, P of n terminals and S of m Steiner points, a Steiner tree of P is a tree spanning all points of P and some (or none or all) points of S. A Steiner tree with length of longest edge minimized is called a bottleneck Steiner tree. In this paper, we study the Euclidean bottleneck Steiner tree problem: given two sets, P and S, and a positive integer k ≤ m, find...
متن کاملFast Approximation Algorithm for the 1-Median Problem
We present a fast approximation algorithm for the 1-median problem. Our algorithm can be applied to metric undirected graphs with node weight. Given a node v, our algorithm repeatedly executes a process of finding a node with higher centrality,in which an approximate centrality of each node v’ is calculated for the subgraph called the best kNSPGS of (v,v’). The best kNSPGS of (v,v’) is a subgra...
متن کاملA constant-factor approximation algorithm for the k-median problem
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those problems in which the aim is to partition a given set of points into clusters so that the points within a cluster are relatively close with respect to some measure. For the metric k-median problem, we are given n poin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2016
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2016.08.005